Solving combinatorial search problems by intelligent backtracking
نویسندگان
چکیده
منابع مشابه
Domain Filtering can Degrade Intelligent Backtracking Search
This paper presents an improved backjumping algonthm for the constraint satisfaction problem, namely conflictdirected backjumping (CBJ). CBJ is then modified such that it can detect infeasible values and removes them from the domains of variables once and for all. A similar modification is then made to Gaschnig's backjumping routine BJ and to Haralick and Elliott's forward checking routine FC. ...
متن کاملIntelligent Backtracking on the Hardest Constraint Problems
A number of researchers have presented evidence that the hardest constraint satisfaction problems tend to arise near the \crossover" point, where around half the problems have solutions. Two recent papers , however, argue that while this is true of the median search cost, the mean search cost has an entirely diierent behavior. The mean search cost appears to be dominated by a relatively small n...
متن کاملSolving Fuzzy Temporal Problems Without Backtracking
The Disjunctive Fuzzy Temporal Constraint Network model allows to express complex qualitative and quantitative temporal constraints, but its complexity is exponential. There are several subsets of these networks that can be solved in polynomial time. Another subset can be reduced to equivalent networks with a tree structure. In order to study the usefulness of these approaches, an evaluation ha...
متن کاملSolving Traveling Salesman Problems via Artificial Intelligent Search Techniques
The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics and combinatorial optimization. It is also considered as the class of the NPcomplete combinatorial optimization problems. By literatures, many algorithms and approaches have been launched to solve such the TSP. However, no current algorithms that can provide the exactly optimal solu...
متن کاملOn Solving Combinatorial Optimization Problems
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1981
ISSN: 0020-0190
DOI: 10.1016/0020-0190(81)90074-0